منابع مشابه
Tracking unbounded Topic Streams
Tracking topics on social media streams is non-trivial as the number of topics mentioned grows without bound. This complexity is compounded when we want to track such topics against other fast moving streams. We go beyond traditional small scale topic tracking and consider a stream of topics against another document stream. We introduce two tracking approaches which are fully applicable to true...
متن کاملBalance with Unbounded Complexes
Given a double complex X there are spectral sequences with the E2 terms being either HI (HII(X)) or HII(HI(X)). But if HI(X) = HII(X) = 0 both spectral sequences have all their terms 0. This can happen even though there is nonzero (co)homology of interest associated with X. This is frequently the case when dealing with Tate (co)homology. So in this situation the spectral sequences may not give ...
متن کاملUnbounded Color Engines
A Color Matching Method (CMM), also called a Color Engine, is a software component that does the color conversion calculations from one device's color space to another. This paper discuses a new working mode for CMMs that allows such software components to operate in a way that is not restricted by the gamut of the device encoding, the gamut of the profile connection space or any intermediate s...
متن کاملUnbounded Semidistributive Lattices
The purpose of this note is to illustrate a construction technique which has proved useful, and apply it to solve an interesting problem. For a more complete discussion of the theory of bounded homomorphisms and lattices, see Chapter II of [3]. 1. Unbounded lattices We begin with a well known criterion for meet semidistributivity. If L is a finite lattice and a ∈ J(L), let κ(a) be the largest e...
متن کاملFIFO anomaly is unbounded
Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson and Shedler [5] constructed reference strings for which page replacement algorithm FIFO [10, 13, 36, 40] produces near twice more page faults in a larger memory than in a smaller one. They formulat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90095-0